Emai's Variable Coding of Adjuncts

Irregular variable length coding

FACULTY OF ENGINEERING, SCIENCE AND MATHEMATICS SCHOOL OF ELECTRONICS AND COMPUTER SCIENCE Doctor of Philosophy Irregular Variable Length Coding by Robert G. Maunder In this thesis, we introduce Irregular Variable Length Coding (IrVLC) and investigate its applications, characteristics and performance in the context of digital multimedia broadcast telecommunications. During IrVLC encoding, the m...

Coding with variable block maps

In this article we study a special class of sliding block maps that we call variable block maps.We characterize the subsets of finite and infinite sequences that can be obtained as the image of another subset of symbolic sequences by a variable block map. On the other way, we show that the coding process induced by such kind of block maps can be reversed, even with partial knowledge about the v...

Near-Capacity Variable Length Coding

Variable length coding of transformed LSF coefficients

In this paper, the use of Karhunen-Loeve transform (KLT) and discrete cosine transform (DCT) is studied for encoding of the line spectrum frequency (LSF) parameters at variable bit rate (VBR). For VBR coding, scalar quantization (SQ) is used with Huffman coding. The basic idea in developing these schemes is using linear transform to exploit the strong intraframe and interframe correlation of LS...

Fewer adjuncts: more relatives*

Substantially agreeing with Hornstein (2009: 81), “it is fair to say that what adjuncts are and how they function grammatically is not well understood”. I refer the reader to, e.g., Hornstein 2009: chapter 4, Hornstein & Nunes 2008, Hunter 2010 or most recently Hunter 2015 for a catalog of properties and problems adjuncts raise in general, and in particular for all previous proposals including ...